-
1 representable event
киб. представимое событиеБольшой англо-русский и русско-английский словарь > representable event
-
2 representable event
Математика: представимое событие -
3 representable event
киберн. -
4 representable
представимый, изобразимый analytically representable function ≈ аналитически представимая функция completely representable predicate ≈ полностью представимый предикат numeralwise [numerically] representable ≈ нумерически представимый numeralwise representable formula ≈ нумерически представимая формула numeralwise representable function ≈ нумерически представимая функция recursively representable operation ≈ рекурсивно представимая операция recursively representable relation ≈ рекурсивно представимое отношение sourcewise representable function ≈ истокообразно представленная функция uniquely representable graph ≈ однозначно представимый граф weakly representable predicate ≈ слабо представимый предикат - analytically representable - nomographically representable - properly representable - recursively representable - representable algebra - representable event - representable function - representable functor - representable integer - representable predicate - strongly representable - totally representable - uniquely representable - weakly representable ПредставимоБольшой англо-русский и русско-английский словарь > representable
-
5 event
-
6 представимое событие
representable event киберн.Русско-английский научно-технический словарь Масловского > представимое событие
-
7 представимое событие
киб. representable eventБольшой англо-русский и русско-английский словарь > представимое событие
-
8 представимое событие
Mathematics: representable eventУниверсальный русско-английский словарь > представимое событие
См. также в других словарях:
Floating point — In computing, floating point describes a method of representing real numbers in a way that can support a wide range of values. Numbers are, in general, represented approximately to a fixed number of significant digits and scaled using an exponent … Wikipedia
virtual — by William Pawlett The virtual is an important term in Baudrillard s later work, used frequently as a noun and also as an adjective in his notions of virtual events, virtual war and virtual power. The most important dimensions of the virtual … The Baudrillard dictionary
Goodman-Nguyen-van Fraassen algebra — A Goodman Nguyen van Fraassen algebra is a type of conditional event algebra (CEA) that embeds the standard Boolean algebra of unconditional events in a larger algebra which is itself Boolean. The goal (as with all CEAs) is to equate the… … Wikipedia
Year 2000 problem — Y2K redirects here. For other uses, see Y2K (disambiguation). The (French) sign reads 3 January 1900 instead of 3 January 2000 The Year 2000 problem (also known as the Y2K problem, the Millennium bug, the Y2K bug, or simply Y2K) was a problem for … Wikipedia
Belief revision — is the process of changing beliefs to take into account a new piece of information. The logical formalization of belief revision is researched in philosophy, in databases, and in artificial intelligence for the design of rational agents.What… … Wikipedia
SIGFPE — Infobox Computing signal description = Erroneous arithmetic operation action = Abnormal termination of the process FPE INTDIV | Integer divide by zero FPE INTOVF | Integer overflow FPE FLTDIV | Floating point divide by zero FPE FLTOVF | Floating… … Wikipedia
Domain Name System — The Domain Name System (DNS) is a hierarchical distributed naming system for computers, services, or any resource connected to the Internet or a private network. It associates various information with domain names assigned to each of the… … Wikipedia
Alan Turing — Turing redirects here. For other uses, see Turing (disambiguation). Alan Turing Turing at the time of his election to Fellowship of the Royal Society … Wikipedia
Hanukkah — For other uses, see Hanukkah (disambiguation). Hanukkah A Hanukkiya or Hanukkah Menorah Official name Hebrew: חֲנֻכָּה or חנוכה English translation: Establishing or Dedication (of the Temple in Jerusalem) … Wikipedia
Lossless data compression — is a class of data compression algorithms that allows the exact original data to be reconstructed from the compressed data. The term lossless is in contrast to lossy data compression, which only allows an approximation of the original data to be… … Wikipedia
Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
